Parsimonious binary-encoding in integer programming
نویسندگان
چکیده
منابع مشابه
Parsimonious binary-encoding in integer programming
We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions.
متن کاملStructure-Encoding Differential Evolution for Integer Programming
Differential Evolution is a competive method for continuous number optimization problems. A novel Structure-Encoding Differential Evolution (SEDE) algorithm was proposed for optimization problems with integer-parameter representation. In the SEDE Algorithm, each decision variable of every individual consists of two domains. One domain is float-encoding which is confined in a narrow range [0, 1]...
متن کاملBinary decision diagrams and integer programming
In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1 Integer Programming and related polyhedral problems. We develop an output-sensitive algorithm for building a threshold BDD, which represents the feasible 0/1 solutions of a linear constraint, and give a parallel and -operation for threshold BDDs to build the BDD for a 0/1 IP. In addition we construct a 0/1 ...
متن کاملGradient Methods for Binary Integer Programming
Integer Programming (IP) is a common problem class where decision variables represent indivisibility or yes/no decisions. IP can also be interpreted as discrete optimizations which are extensively used in the areas of routing decisions, fleet assignment, and aircraft/aircrew scheduling. Solving IP models is much harder than solving Linear Programming (LP) models because of their intrinsically c...
متن کاملRobot Path Planning in 3D Space Using Binary Integer Programming
This paper presents a novel algorithm for path planning of mobile robots in known 3D environments using Binary Integer Programming (BIP). In this approach the problem of path planning is formulated as a BIP with variables taken from 3D Delaunay Triangulation of the Free Configuration Space and solved to obtain an optimal channel made of connected tetrahedrons. The 3D channel is then partitioned...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2005
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2005.06.001